Rethinking Bi-Level Optimization in Neural Architecture Search: A Gibbs Sampling Perspective
نویسندگان
چکیده
One-Shot architecture search, which aims to explore all possible operations jointly based on a single model, has been an active direction of Neural Architecture Search (NAS). As well-known one-shot solution, Differentiable (DARTS) performs continuous relaxation the architecture's importance and results in bi-level optimization problem. However, as many recent studies have shown, DARTS cannot always work robustly for new tasks, is mainly due approximate solution optimization. In this paper, neural search addressed by adopting directed probabilistic graphical model represent joint probability distribution over data model. Then, architectures are searched optimized Gibbs sampling. We rethink problem task sampling from posterior distribution, expresses preferences different models given observed dataset. evaluate our proposed NAS method -- GibbsNAS space used DARTS/ENAS NAS-Bench-201. Experimental multiple show efficacy stability approach.
منابع مشابه
Solving Optimal Neural Layout by Gibbs Sampling
Neural systems of organisms derive their functionality largely from the numerous and intricate connections between individual components. These connections are costly and have been refined via evolutionary pressure that acts to maximize their functionality while minimizing the associated cost. This tradeoff can be formulated as a constrained optimization problem. In this paper, we use simulated...
متن کاملProgressive Neural Architecture Search
We propose a method for learning CNN structures that is more efficient than previous approaches: instead of using reinforcement learning (RL) or genetic algorithms (GA), we use a sequential model-based optimization (SMBO) strategy, in which we search for architectures in order of increasing complexity, while simultaneously learning a surrogate function to guide the search, similar to A* search....
متن کاملThe Gibbs Cloner for Combinatorial Optimization, Counting and Sampling
We present a randomized algorithm, called the cloning algorithm, for approximating the solutions of quite general NP-hard combinatorial optimization problems, counting, rare-event estimation and uniform sampling on complex regions. Similar to the algorithms of Diaconis–Holmes–Ross and Botev–Kroese the cloning algorithm is based on the MCMC (Gibbs) sampler equipped with an importance sampling pd...
متن کاملThe Opacity of Glass Rethinking Transparency in Contemporary Architecture
In this paper, an exchange of letters between the philosopher Jacques Derrida and architect Peter Eisenman is used as a catalyst to discuss the material qualities of glass and its relationship with the concept of transparency in architecture. In his criticism of an architecture devoid of human qualities, Derrida uses glass, defined through Walter Benjamin’s writings, as a hard and cold material...
متن کاملModel building using bi-level optimization
In many problems from different disciplines such as engineering, physics, medicine, and biology, a series of experimental data is used in order to generate a model that can describe a system with minimum noise. The procedure for building a model provides a description of the behavior of the system under study and can be used to give a prediction for the future. Herein a novel hierarchical bi-le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i12.17262